CS369E: Communication Complexity (for Algorithm Designers) Lectures #5–6: Lower Bounds for the Extension Complexity of Polytopes∗
نویسنده
چکیده
You’ve probably seen some polynomial-time algorithms for the problem of computing a maximum-weight matching of a bipartite graph. Many of these, like the Kuhn-Tucker algorithm [?] are “combinatorial algorithms,” meaning that all of its steps work directly with the graph. Linear programming is also an effective tool for solving many discrete optimization problems. For example, consider the following linear programming relaxation of the maximumweight bipartite matching problem (for a weighted bipartite graph G = (U, V,E,w)):
منابع مشابه
Communication Complexity (for Algorithm Designers)
Preface The best algorithm designers prove both possibility and impossibility results — both upper and lower bounds. For example, every serious computer scientist knows a collection of canonical NP-complete problems and how to reduce them to other problems of interest. Communication complexity offers a clean theory that is extremely useful for proving lower bounds for lots of different fundamen...
متن کاملCS369E: Communication Complexity (for Algorithm Designers) Lecture #3: Lower Bounds for Compressive Sensing∗
We begin with an appetizer before starting the lecture proper — an example that demonstrates that randomized one-way communication protocols can sometimes exhibit surprising power. It won’t surprise you that the Equality function — with f(x,y) = 1 if and only if x = y — is a central problem in communication complexity. It’s easy to prove, by the Pigeonhole Principle, that its deterministic one-...
متن کاملLinear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کاملCMSC 858F: Algorithmic Lower Bounds: Fun with Hardness Proofs Fall 2014 Introduction to Streaming Algorithms
In the previous lectures, we looked at the online algorithms and studies some of the related problems. Now we look into streaming algorithms, which have many similarities with online algorithm. They both require decisions before seeing all data but streaming algorithms can defer actions with limited memory. In these two lectures, we introduce streaming algorithms, related communication complexi...
متن کاملCS 369 E : Communication Complexity ( for Algorithm Designers ) Lecture # 6 : Data Structure Lower Bounds ∗
Next we discuss how to use communication complexity to prove lower bounds on the performance — meaning space, query time, and approximation — of data structures. Our case study will be the high-dimensional approximate nearest neighbor problem. There is a large literature on data structure lower bounds. There are several different ways to use communication complexity to prove such lower bounds, ...
متن کامل